美俄军事卫星系统发展现状与趋势

目前,世界各国意识到信息对战斗力生成的巨大作用,纷纷开始积极发展军用卫星体系。从通信卫星、侦察卫星、预警卫星和导航定位卫星四个方面入手,介绍了美俄军事卫星系统的具体型号、数量、发射时间、运行状况等情况,并分析了军事卫星系统的发展趋势。现代航天技术的发展,极大地改变着人类的生活方式,也必将影响未来战争的发展模式。     

基于ANSYS的油罐拱顶与罐壁关联性分析

针对油罐拱顶与罐壁上部容易出现失稳变形的实际问题,基于ANSYS建立了油罐有限元模型,对油罐结构稳定性进行数值模拟,探讨加载关联性和结构关联性对均匀外压作用下油罐稳定性的影响。结果表明:分析油罐结构稳定性时,对于给定尺寸的油罐,失稳发生在结构较薄弱部位;拱顶和罐壁可独立加载求解临界载荷,取较小值作为油罐的临界载荷;油罐的失稳分析要考虑拱顶与罐壁间相互作用对总体临界载荷的影响。研究结果可为基于有限元法的油罐稳定性设计和分析提供一定参考。     

PDSC评定柴油氧化安定性

为研究一种操作简便、检测快速的柴油氧化安定性评定方法,采用高压差示扫描量热法(PDSC)对柴油氧化安定性进行评定,通过单因素变量法分析了升温速率、恒容氧压、试样量对柴油氧化安定性的影响,确定了3种因素水平分别为8~12℃/min,2.5~4.5 MPa,2.5~3.5 mg。通过正交试验法得出升温速率对柴油氧化安定性的影响最大,恒容氧压的影响最小。方差分析表明在升温速率为8℃/min,恒容氧压为3.5 MPa,试样量为3.0 mg时,试验方法的区分性最佳。在该试验条件下,考察了5种油样的重复性,结果表明PDSC法的重复性满足标准要求。     

基于快速傅里叶变换的扫描单发单收面阵近场成像技术

近年来,扫描单发单收面阵近场成像技术在安检、医疗等民用领域中引起了广泛关注.然而,传统的距离徙动算法在对回波进行处理的过程中无法避免多步近似和插值操作,并且忽视了信号传播衰减带来的不利影响.因此,提出了一种基于快速傅里叶变换的扫描单发单收面阵近场成像技术,该技术通过保留回波模型中的幅度衰减因子,并根据目标回波方程特性对...     

高超声速气动热化学非平衡效应数值分析研究

通过数值分析研究了化学非平衡效应对气动加热问题的影响.分别以量热完全气体、单组分热完全气体和5组分化学非平衡气体为气体模型,计算了圆柱钝头的绕流流场和壁面热流密度分布,比较并分析了高温化学非平衡效应对流场特性,尤其是气动加热特性的影响.结果分析表明,高温化学非平衡效应可使激波层变薄,激波层内温度大幅下降,从而会严重影响气动热环境特性,是影响高超声速飞行器热防护设计的重要因素.     

舰炮武器试验中目标坐标真值修正方法

为保证舰炮武器系统动态精度解算结果的准确性,分析了舰炮武器系统动态精度试验中,GPS作为目标瞬时坐标真值测量设备时,因其安装位置与雷达跟踪测量中心不重合所引起的误差,并提出了一种简便、可行的误差修正方法。给出了误差修正示例,比较分析了GPS不同安装位置所引起的误差,为类似试验中目标瞬时坐标真值的处理提供参考。     

非定常Euler方程数值计算中高精度格式应用

采用五阶精度加权紧致非线性格式(WCNS)和非定常“双时间步”方法求解非定常Euler方程,模拟NACA0012翼型强迫俯仰振动流场,研究了高精度格式应用到非定常计算时“双时间步”方法物理时间步长、子迭代收敛判据、子迭代步数以及物理时间导数离散方法对计算精度和计算效率的影响.     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

在求“变”中推进西南边防部队转型发展

西南边防部队驻防于我国西南边境地区,西起西藏自治区的日土县,东至广西壮族自治区的防城港市,担负着边防管控和边境防御作战等重要职能,在捍卫国家主权和安全中地位作用十分特殊。随着军队调整改革的深入落实,西南边防部队正处于转型重塑的关键时期,必须紧紧围绕新形势、新体制、新职能,着眼应急指挥、军事训练、边境管控、内外环境等关键要素和现实问题,在求"变"中推进创新发展,不断提升履职能力,切实为捍卫国家领土主权完整和维护边境稳定提供坚强保证。     

Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010